A Practical System for Globally Revoking the Unlinkable Pseudonyms of Unknown Users

نویسندگان

  • Stefan Brands
  • Liesje Demuynck
  • Bart De Decker
چکیده

We propose the first single sign-on system in which a user can access services using unlinkable digital pseudonyms that can all be revoked in case he or she abuses any one service. Our solution does not rely on key escrow: each user needs to trust only her own computing device with following our protocols in order to be assured of the unconditional untraceability and unlinkability of her pseudonyms. In applications where users hook pseudonyms up to legacy identifiers or legacy accounts at service providers, our system guarantees that service providers (even if they collude with the pseudonym issuer) do not gain any correlation powers over users. Our solution involves two novel ingredients: a technique for invisibly chaining all of a user’s pseudonyms in a manner that permits the revocation of all of them on the basis of any one of them (without knowing the user’s identity with the issuer) and a sublinear-time proof that a committed number is not on a blacklist without revealing additional information about the number. Our solution is highly practical. CR Subject Classification : E.3 [Data]: Data Encryption – Public key cryptosystems. A practical system for globally revoking the unlinkable pseudonyms of unknown users Stefan Brands Credentica & McGill School of Comp. Sc. 740 Notre Dame St. W., Suite 1500 Montreal (QC), Canada H3C 3X6 brands@{credentica.com,cs.mcgill.ca} www.credentica.com Liesje Demuynck K.U.Leuven, Dept. of Comp. Sci. Celestijnenlaan 200A B-3001 Heverlee, Belgium [email protected] www.cs.kuleuven.be Bart De Decker K.U.Leuven, Dept. of Comp. Sci. Celestijnenlaan 200A B-3001 Heverlee, Belgium [email protected] www.cs.kuleuven.be

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup

An attacker who can control arbitrarily many user identities can break the security properties of most conceivable systems. This is called a “Sybil attack”. We present a solution to this problem that does not require online communication with a trusted third party and that in addition preserves the privacy of honest users. Given an initial so-called Sybil-free identity domain, our proposal can ...

متن کامل

An efficient and unlinkable incentives scheme

A popular way to encourage user actions or contributions in a service are the widely adopted incentives schemes. They represent schemes in which users are offered certain benefits or reputation in return for their actions. However, these systems rely on service providers to manage users’ profiles, which record all the activity of the users, the benefits they are entitled to and/or reputation. T...

متن کامل

Composable and Modular Anonymous Credentials: Definitions and Practical Constructions

It takes time for theoretical advances to get used in practical schemes. Anonymous credential schemes are no exception. For instance, existing schemes suited for real-world use lack formal, composable definitions, partly because they do not support straight-line extraction and rely on random oracles for their security arguments. To address this gap, we propose unlinkable redactable signatures (...

متن کامل

Domain-Specific Pseudonymous Signatures Revisited

Domain-Specific Pseudonymous Signature schemes were recently proposed for privacy preserving authentication of digital identity documents by the BSI, German Federal Office for Information Security. The crucial property of domain-specific pseudonymous signatures is that a signer may derive unique pseudonyms within a so called domain. Now, the signer’s true identity is hidden behind his domain ps...

متن کامل

Tracing Misbehaving Users by Utilizing Ticket-Based Protocols by Trusted Third Party in Anonymizing Networks

–Anonymizing networks provides network services to users without specific identity. Network administrator cannot identify user actions in anonymizing networks. Anonymizing networks such as The Onion Routing Networks (TOR) uses a layer structured encrypted message and series of routers each with a key to decrypt and forward the message. Which hide’s the client’s IP address from the server. The l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007